Hard-constrained vs. soft-constrained parameter estimation

نویسندگان

  • A. Benavoli
  • L. Chisci
چکیده

The paper aims at contrasting two different ways of incorporating a-priori information in parameter estimation, i.e. hard-constrained and soft-constrained estimation. Hardconstrained estimation can be interpreted, in the Bayesian framework, as Maximum A-posteriori Probability (MAP) estimation with uniform prior distribution over the constraining set, and amounts to a constrained Least-Squares (LS) optimization. Novel analytical results on the statistics of the hard-constrained estimator are presented for a linear regression model subject to lower and upper bounds on a single parameter. This analysis allows to quantify the Mean Squared Error (MSE) reduction implied by constraints and to see how this depends on the size of the constraining set compared to the confidence regions of the unconstrained estimator. Contrastingly, soft-constrained estimation can be regarded as MAP estimation with Gaussian prior distribution and amounts to a less computationally demanding unconstrained LS optimization with a cost suitably modified by the mean and covariance of the Gaussian distribution. Results on the design of the prior covariance of the soft-constrained estimator for optimal MSE performance are also given. Finally, a practical case-study concerning a line fitting estimation problem is presented in order to validate the theoretical results derived in the paper as well as to compare the performance of the hard-constrained and softconstrained approaches under different settings.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Repeated Record Ordering for Constrained Size Clustering

One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...

متن کامل

Constrained Nonlinear Estimation of Road Friction Coefficient and Wheel Slip for Control of Anti-Lock Braking System

In designing the anti-lock braking system (ABS), some states and parameters of vehicle system such as road friction of coefficient and wheel slip should be estimated due to lack of cost effective and reliable sensors for direct measurement. Because of nonlinear characteristics of vehicle dynamics and tire forces, development of a nonlinear estimation algorithm is necessary. However, considerati...

متن کامل

Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems

Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...

متن کامل

Resource Constrained Project Scheduling with Material Ordering: Two Hybridized Meta-Heuristic Approaches (TECHNICAL NOTE)

Resource constrained project scheduling problem (RCPSP) is mainly investigated with the objective of either minimizing project makespan or maximizing project net present value. However, when material planning plays a key role in a project, the existing models cannot help determining material ordering plans to minimize material costs. In this paper, the RCPSP incorporated with the material order...

متن کامل

Gradient Hard Thresholding Pursuit for Sparsity-Constrained Optimization

Hard Thresholding Pursuit (HTP) is an iterative greedy selection procedure for finding sparse solutions of underdetermined linear systems. This method has been shown to have strong theoretical guarantee and impressive numerical performance. In this paper, we generalize HTP from compressive sensing to a generic problem setup of sparsity-constrained convex optimization. The proposed algorithm ite...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006